Daniel Marx

Results: 86



#Item
41

Tractable hypergraph properties for constraint satisfaction and conjunctive queries ´ Daniel Marx

Add to Reading List

Source URL: www.cs.bme.hu

Language: English - Date: 2010-05-16 10:30:27
    42

    The Complexity of Tree Multicolorings Dániel Marx Budapest University of Technology and Economics 1

    Add to Reading List

    Source URL: www.cs.bme.hu

    Language: English - Date: 2007-10-29 10:19:15
      43

      Parameterized complexity of constraint satisfaction problems ´ Daniel Marx Budapest University of Technology and Economics

      Add to Reading List

      Source URL: www.cs.bme.hu

      Language: English - Date: 2007-10-29 10:15:58
        44

        Minicourse on parameterized algorithms and complexity Part 5: Treewidth Dániel Marx Jagiellonian University in Kraków

        Add to Reading List

        Source URL: www.cs.bme.hu

        Language: English - Date: 2015-04-22 03:49:11
          45

          Finding small patterns in permutations in linear time Sylvain Guillemot Dániel Marx

          Add to Reading List

          Source URL: www.cs.bme.hu

          Language: English - Date: 2014-01-05 10:53:26
            46

            Minimum sum multicoloring on the edges of planar graphs and partial k-trees ´ Daniel Marx Budapest University of Technology and Economics

            Add to Reading List

            Source URL: www.cs.bme.hu

            Language: English - Date: 2007-10-29 10:18:38
              47

              Improving local search using parameterized complexity ´ Daniel Marx Budapest University of Technology and Economics

              Add to Reading List

              Source URL: www.cs.bme.hu

              Language: English - Date: 2008-12-10 12:51:14
                48

                Decomposition theorems for graphs excluding structures Dániel Marx Institute for Computer Science and Control, Hungarian Academy of Sciences (MTA SZTAKI)

                Add to Reading List

                Source URL: www.cs.bme.hu

                Language: English - Date: 2013-09-13 04:50:18
                  49

                  Important separators and spiders Dániel Marx Tel Aviv University, Israel Bertinoro Workshop on Algorithms and Graphs December 8, 2009, Bertinoro, Italy

                  Add to Reading List

                  Source URL: www.cs.bme.hu

                  Language: English - Date: 2010-01-12 10:11:42
                    50

                    Efficient Approximation Schemes for Geometric Problems? ´ Daniel Marx ¨ zu Berlin

                    Add to Reading List

                    Source URL: www.cs.bme.hu

                    Language: English - Date: 2007-10-29 10:14:24
                      UPDATE